Linear Network Codes and Systems of Polynomial Equations
نویسندگان
چکیده
منابع مشابه
Coupled systems of equations with entire and polynomial functions
We consider the coupled system$F(x,y)=G(x,y)=0$,where$$F(x, y)=bs 0 {m_1} A_k(y)x^{m_1-k}mbox{ and } G(x, y)=bs 0 {m_2} B_k(y)x^{m_2-k}$$with entire functions $A_k(y), B_k(y)$.We derive a priory estimates for the sums of the rootsof the considered system andfor the counting function of roots.
متن کاملExact and numerical solutions of linear and non-linear systems of fractional partial differential equations
The present study introduces a new technique of homotopy perturbation method for the solution of systems of fractional partial differential equations. The proposed scheme is based on Laplace transform and new homotopy perturbation methods. The fractional derivatives are considered in Caputo sense. To illustrate the ability and reliability of the method some examples are provided. The results ob...
متن کاملIntegrability of planar polynomial differential systems through linear differential equations . ∗
In this work, we consider rational ordinary differential equations dy/dx = Q(x, y)/P (x, y), with Q(x, y) and P (x, y) coprime polynomials with real coefficients. We give a method to construct equations of this type for which a first integral can be expressed from two independent solutions of a second–order homogeneous linear differential equation. This first integral is, in general, given by a...
متن کاملPolynomial Preconditioning for Specially Structured Linear Systems of Equations
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of solvers, particularly for some specially structured systems. In this paper the suitability of GLS preconditioning for a class of specially structured linear system of equations is demonstrated. The algorithms are impl...
متن کاملThe Tutte Polynomial and Linear Codes
A linear code of length n and dimension k is called a [n, k]-code. If G is a r × n matrix over GF (q), whose rows form a basis for C, then G is a generator matrix for C. As with every matrix, there is an associated matroid, which in this case depends only on C. Hence the matroid is M(C). The dual code, C∗, of C, is defined by C∗ = {v ∈ GF (q)n|v · w = 0 ∀w ∈ C}. If C is a [n, k]-code, then C∗ i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2008.920209